A Perturbation Approach to Vector Optimization Problems: Lagrange and Fenchel–Lagrange Duality
نویسندگان
چکیده
In this paper, we study a general minimization vector problem which is expressed in terms of perturbation mapping defined on product locally convex Hausdorff topological spaces with values another space. Several representations the epigraph conjugate are given, and then, variants Farkas lemmas associated system by established. A dual so-called loose mentioned stable strong duality results between these pairs primal–dual problems The just obtained then applied to class composed constrained optimization problems. For problems, two concrete mappings proposed. These give rise including Lagrange several kinds Fenchel–Lagrange under consideration. Stable for derived. classes (and scalar) also considered at end paper illustrate significance our approach.
منابع مشابه
A note on symmetric duality in vector optimization problems
In this paper, we establish weak and strong duality theorems for a pair of multiobjective symmetric dual problems. This removes several omissions in the paper "Symmetric and self duality in vector optimization problem, Applied Mathematics and Computation 183 (2006) 1121-1126".
متن کاملDuality for almost convex optimization problems via the perturbation approach
We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from the convex analysis are extended to the case of almost convex sets and functions. The duality for some classes of primal-dual problems is derived as a special case of the general approach. The sufficient regularity conditions we ...
متن کاملDuality for vector equilibrium problems with constraints
In the paper, we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior. Then, their applications to optimality conditions for quasi-relative efficient solutions are obtained. Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...
متن کاملA New Approach to Duality in Vector Optimization
In this article we develop a new approach to duality theory for convex vector optimization problems. We modify a given (set-valued) vector optimization problem such that the image space becomes a complete lattice (a sublattice of the power set of the original image space), where the corresponding infimum and supremum are sets that are related to the set of (minimal and maximal) weakly efficient...
متن کاملDuality for vector optimization problems via a general scalarization
Considering a vector optimization problem to which properly efficient solutions are defined by using convex cone-monotone scalarization functions, we attach to it, by means of perturbation theory, new vector duals. When the primal problem, the scalarization function and the perturbation function are particularized, different dual vector problems are obtained, some of them already known in the l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2022
ISSN: ['0022-3239', '1573-2878']
DOI: https://doi.org/10.1007/s10957-022-02052-9